Single-Player and Two-Player Buttons & Scissors Games

نویسندگان

  • Kyle Burke
  • Erik D. Demaine
  • Harrison Gregg
  • Robert A. Hearn
  • Adam Hesterberg
  • Michael Hoffmann
  • Hiro Ito
  • Irina Kostitsyna
  • Jody Leonard
  • Maarten Löffler
  • Aaron Santiago
  • Christiane Schmidt
  • Ryuhei Uehara
  • Yushi Uno
  • Aaron Williams
چکیده

We study the computational complexity of the Buttons & Scissors game and obtain sharp thresholds with respect to several parameters. Specifically we show that the game is NP-complete for C = 2 colors but polytime solvable for C = 1. Similarly the game is NP-complete if every color is used by at most F = 4 buttons but polytime solvable for F ≤ 3. We also consider restrictions on the board size, cut directions, and cut sizes. Finally, we introduce several natural two-player versions of the game and show that they are PSPACE-complete.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract)

We study the computational complexity of the Buttons & Scissors game and obtain sharp thresholds with respect to several parameters. Specifically we show that the game is NP-complete for C = 2 colors but polytime solvable for C = 1. Similarly the game is NP-complete if every color is used by at most F = 4 buttons but polytime solvable for F ≤ 3. We also consider restrictions on the board size, ...

متن کامل

Pure Saddle Points and Symmetric Relative Payoff Games

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure saddle point. Further sufficient conditions for existence a...

متن کامل

Pure strategy equilibria in symmetric two-player zero-sum games

We show that a symmetric two-player zero-sum game has a pure strategy equilibrium if and only if it is not a generalized rock-paper-scissors matrix. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure equilibrium. Further sufficient conditions for existence are provided. We point out that the class of symmetric two-player zero-sum games coincides with ...

متن کامل

Buttons & Scissors is NP-Complete

Buttons & Scissors is a popular single-player puzzle. A level is played on an n-by-n grid, where each position is empty or has a single coloured button sewn onto it. The player’s goal is to remove all of the buttons using a sequence of horizontal, vertical, and diagonal scissor cuts. Each cut removes all buttons between two distinct buttons of the same colour, and is not valid if there is an in...

متن کامل

Investigating the Effect of Rewards on Individual Players' Efforts: A Behavioral Approach

The main goal of the study is to examine the effect of rewards on the behavior of players in a team activity. In this framework, by performing 12 sequential and simultaneous games in a laboratory environment examine the rewarding effect on players' behavior. Students from Yazd universities surveyed and the sample of 182 students is in the form of two groups, which collected in total for 2184 ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1607.01826  شماره 

صفحات  -

تاریخ انتشار 2015